Mean Shift: Construction and Convergence Proof

نویسنده

  • Konstantinos G. Derpanis
چکیده

In most low-level computer vision problems, very little information (if any) is known about the true underlying probability density function, such as its shape, number of mixture components, etc.. Due to this lack of knowledge, parametric approaches are less relevant, rather one has to rely on non-parametric methods. In this note we consider the construction and convergence proof of the non-parametric mean shift method which was developed by Fukunaga and Hostetler (Fukunaga & Hostetler, 1975), later adapted by Cheng (Cheng, 1995) for the purpose of image analysis and more recently popularized in the computer vision literature by Comaniciu and Meer (Comaniciu & Meer, 2002). The mean shift procedure represents a simple iterative non-parametric procedure for density mode seeking. For a general treatment of density estimation the reader is referred to (Silverman, 1998).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Analysis of Mean Shift Algorithm

The research of its convergence of Mean Shift algorithm is the foundation of its application. Comaniciu and Li Xiang-ru have respectively provided the proof for the convergence of Mean Shift but they both made a mistake in their proofs. In this paper, the imprecise proofs existing in some literatures are firstly pointed out. Then, the local convergence is proved in a new way and the condition o...

متن کامل

On the convergence of the mean shift algorithm in the one-dimensional space

The mean shift algorithm is a non-parametric and iterative technique that has been used for finding modes of an estimated probability density function. It has been successfully employed in many applications in specific areas of machine vision, pattern recognition, and image processing. Although the mean shift algorithm has been used in many applications, a rigorous proof of its convergence is s...

متن کامل

On the Convergence of the Mean Shift Algorithm with the Gaussian Kernel

The mean shift (MS) algorithm is a non-parametric, iterative technique that has been used to find modes of an estimated probability density function (pdf). Although the MS algorithm has been widely used in many applications, such as clustering, image segmentation, and object tracking, a rigorous proof for its convergence is still missing. This paper tries to fill some of the gaps between theory...

متن کامل

Prior-Constrained Scale-Space Mean Shift

This paper proposes a new variational bound optimization framework for incorporating spatial prior information to the mean shift-based data-driven mode analysis, offering flexible control of the mean shift convergence. Two forms of Gaussian spatial priors are considered. Attractive prior pulls the convergence toward a desired location. Repulsive prior pushes away from such a location. Using a g...

متن کامل

Accelerated Convergence Using Dynamic Mean Shift

Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this paper, we improve the convergence speed of mean shift by dynamically updating the sample set during the iterations, and the resultant procedure is called dynamic mean shift (DMS). When the data is locally Gaussian, it c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006